# ---
# title: 279. Perfect Squares
# id: problem279
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Math, Dynamic Programming, Breadth-first Search
# link: <https://leetcode.com/problems/perfect-squares/description/>
# hidden: true
# ---
# 
# Given a positive integer _n_ , find the least number of perfect square numbers
# (for example, `1, 4, 9, 16, ...`) which sum to _n_.
# 
# **Example 1:**
# 
#     
#     
#     Input: _n_ = 12
#     Output: 3 
#     Explanation:12 = 4 + 4 + 4.
# 
# **Example 2:**
# 
#     
#     
#     Input: _n_ = 13
#     Output: 2
#     Explanation:13 = 4 + 9.
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
